Indexing Data-oriented Overlay Networks
نویسندگان
چکیده
The application of structured overlay networks to implement index structures for data-oriented applications such as peer-to-peer databases or peer-to-peer information retrieval, requires highly efficient approaches for overlay construction, as changing application requirements frequently lead to re-indexing of the data and hence (re)construction of overlay networks. This problem has so far not been addressed in the literature and thus we describe an approach for the efficient construction of data-oriented, structured overlay networks from scratch in a self-organized way. Standard maintenance algorithms for overlay networks cannot accomplish this efficiently, as they are inherently sequential. Our proposed algorithm is completely decentralized, parallel, and can construct a new overlay network with short latency. At the same time it ensures good loadbalancing for skewed data key distributions which result from preserving key order relationships as necessitated by data-oriented applications. We provide both a theoretical analysis of the basic algorithms and a complete system implementation that has been tested on PlanetLab. We use this implementation to support peer-to-peer information retrieval and database applications.
منابع مشابه
On Indexing Multidimensional Data In A P2P Context
Based on their remarkable properties (fault tolerance, scalability, decentralization), P2P systems tend to be largely accepted as a common support for deploying massively distributed data management applications. Some of the existing P2P systems are built over hybrid networks where certain peers are specialized in indexing. Others make use of DHTs as common support for data indexing. However, o...
متن کاملIndexing data-oriented overlay networks using belief propagation
In this paper we discuss the problem of data-oriented partitioning in large-scale overlay networks, as required by peer-topeer databases or by peer-to-peer information retrieval. The goal is to partition a large set of nodes into k partitions with the additional requirement of meeting certain load-balancing constraints without global knowledge of the network’s parameters, i.e., the desired numb...
متن کاملAn Indexing Method for Supporting Spatial Queries in Structured Peer-to-peer Systems
To provide the efficient supporting spatial data queries in peer-to-peer systems has recently received much attention. Most proposed methods tried to use hop count to represent the transmission delay, and the total message count to estimate the cost of query processing. For the ignorance of the differences between DHT lookups and spatial queries, and distinction between physical networks and ov...
متن کاملA Short Survey on P2P Data Indexing
P2P data indexing has recently attracted a great many research efforts. For various proposed schemes, there are generally two taxonomies: 1) From a systematic point of view, existing schemes fall into two categories: the over-DHT indexing paradigm, which as a layered manner, indexes data in DHT key space (i.e., over DHT), and the overlay-dependent indexing paradigm, which indexes data directly ...
متن کاملEfficient R-tree Based Indexing Scheme for Server- Centric Cloud Storage System
Cloud storage system poses new challenges to the community to support efficient concurrent querying tasks for various data-intensive applications, where indexes always hold important positions. A practical method is proposed to construct a two-layer indexing scheme for multi-dimensional data in diverse server-centric cloud storage system. RT-HCN is proposed, which is an indexing scheme integrat...
متن کامل